منابع مشابه
A comparison of polynomial evaluation schemes
The goal of this paper is to analyze two polynomial evaluation schemes for multiple precision floating point arithmetic. Polynomials are used extensively in numerical computations (Taylor series for mathematical functions, root finding) but a rigorous bound of the error on the final result is seldom provided. We provide such an estimate for the two schemes and find how to reduce the number of o...
متن کاملPolynomial-Time Approximation Schemes
Let Π be an NP-hard optimization problem, and let A be an approximation algorithm for Π. For an instance I of Π, let A(I) denote the objective value when running A on I, and let OPT (I) denote the optimal objective value. The approximation ratio of A for the instance I is RA(I) = A(I)/OPT (I), thus, when Π is minimization (maximization) problem RA(I) ≥ 1 (RA(I) ≤ 1). A polynomial time approxima...
متن کاملPolynomial-Time Approximation Schemes
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, ...
متن کاملKite-freeP- andQ-polynomial schemes
Let d denote a non-negative integer. A symmetric, d-class association scheme (or simply a scheme) is a configuration Y = (X, Ri0≤i≤d), where X is a nonempty set and R0, R1, · · · , Rd are non-empty subsets of the Cartesian product X ×X, possessing the following properties. (i) (x, y) ∈ R0 if and only if x = y (x, y ∈ X). (ii) (x, y) ∈ Ri for exactly one i (0 ≤ i ≤ d), (x, y ∈ X). (iii) R i = Ri...
متن کاملFully Polynomial Time Approximation Schemes
Recall that the approximation ratio for an approximation algorithm is a measure to evaluate the approximation performance of the algorithm. The closer the ratio to 1 the better the approximation performance of the algorithm. It is notable that there is a class of NP-hard optimization problems, most originating from scheduling problems, for which there are polynomial time approximation algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1975
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1975-0388757-3